The quadratic assignment polytope

نویسندگان

  • Alain Billionnet
  • Sourour Elloumi
  • Alain Faye
  • Jean Rostand
چکیده

We study the quadratic assignment problem (with n variables) from a polyhedral point of view by considering the quadratic assignment polytope that is defined as the convex hull of the solutions of the linearized problem (with n + 2 n 2 n −1 ( ) variables). We give the dimension of the polytope and a minimal description of its affine hull. We also propose a family of facets with a separation algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MATHEMATICAL ENGINEERING TECHNICAL REPORTS The Quadratic Semi-Assignment Polytope

We study a polytope which arises from a mixed integer programming formulation of the quadratic semi-assignment problem. We introduce an isomorphic projection in order to transform the polytope to another essentially equivalent and tractable polytope. As a result, some basic polyhedral properties, such as the dimension, the affine hull, and the trivial facets, are obtained in quite a simple way....

متن کامل

A Basic Study of the QAP - Polytope

We investigate a polytope (the QAP-Polytope) beyond a \natural" integer programming formulation of the Quadratic Assignment Problem (QAP) that has been used successfully in order to compute good lower bounds for the QAP in the very recent years. We present basic structural properties of the QAP-Polytope, partially independently also obtained by Rijal (1995). The main original contribution of th...

متن کامل

The QAP-polytope and the star transformation

The quadratic assignment problem (QAP) maybe was for a long time the one among the prominent NP-hard combinatorial optimization problems about which the fewest polyhedral results had been known. Recent work of Rijal (1995) and Padberg and Rijal (1996) has on the one hand yielded some basic facts about the associated quadratic assignment polytope, but has on the other hand shown that \naive" inv...

متن کامل

Box-inequalities for quadratic assignment polytopes

Linear Programming based lower bounds have been considered both for the general as well as for the symmetric quadratic assignment problem several times in the recent years. Their quality has turned out to be quite good in practice. Investigations of the polytopes underlying the corresponding integer linear programming formulations (the non-symmetric and the symmetric quadratic assignment polyto...

متن کامل

Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes

We consider two polytopes. The quadratic assignment polytope QAP(n) is the convex hull of the set of tensors x⊗x, x ∈ Pn, where Pn is the set of n×n permutation matrices. The second polytope is defined as follows. For every permutation of vertices of the complete graph Kn we consider appropriate (n 2 ) × (n 2 ) permutation matrix of the edges of Kn. The Young polytope P ((n − 2, 2)) is the conv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011